An Ordered Upwind Method with Precomputed Stencil and Monotone Node Acceptance for Solving Static Convex Hamilton-Jacobi Equations

نویسندگان

  • Kenneth Robert Alton
  • Ian M. Mitchell
چکیده

We define a -causal discretization of static convex Hamilton-Jacobi Partial Differential Equations (HJ PDEs) such that the solution value at a grid node is dependent only on solution values that are smaller by at least . We develop a Monotone Acceptance Ordered Upwind Method (MAOUM) that first determines a consistent, -causal stencil for each grid node and then solves the discrete equation in a single-pass through the nodes. MAOUM is suited to solving HJ PDEs efficiently on highly-nonuniform grids, since the stencil size adjusts to the level of grid refinement. MAOUM is a Dijkstra-like algorithm that computes the solution in increasing value order by using a heap to sort proposed node values. If > 0, MAOUM can be converted to a Dial-like algorithm that sorts and accepts values using buckets of width . We present three hierarchical criteria for -causality of a node value update from a simplex of nodes in the stencil. The asymptotic complexity of MAOUM is found to be O((Ψ̂ )dN logN), where d is the dimension, Ψ̂ is a measure of anisotropy in the equation, and is a measure of the degree of nonuniformity in the grid. This complexity is a constant factor (Ψ̂ )d greater than that of the Dijkstra-like Fast Marching Method, but MAOUM solves a much more general class of static HJ PDEs. Although factors into the asymptotic complexity, experiments demonstrate that grid nonuniformity does not have a large effect on the computational cost of MAOUM in practice. Our experiments indicate that, due to the stencil initialization overhead, MAOUM performs similarly or slightly worse than the comparable Ordered Upwind Method presented in [Sethian and Vladimirsky, SIAM J. Numer. Anal., 41 (2003)] for two examples on uniform meshes, but considerably better for an example with rectangular speed profile and significant grid refinement around nonsmooth parts of the solution. We test MAOUM on a diverse set of examples, including seismic wavefront propagation and robotic navigation with wind and obstacles.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence analysis of the fast sweeping method for static convex Hamilton–Jacobi equations

In this work, we study the convergence of an efficient iterative method, the fast sweeping method (FSM), for numerically solving static convex Hamilton–Jacobi equations. First, we show the convergence of the FSM on arbitrary meshes. Then we illustrate that the combination of a contraction property of monotone upwind schemes with proper orderings can provide fast convergence for iterative method...

متن کامل

Ordered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms

We develop a family of fast methods for approximating the solutions to a wide class of static Hamilton–Jacobi PDEs; these fast methods include both semi-Lagrangian and fully Eulerian versions. Numerical solutions to these problems are typically obtained by solving large systems of coupled nonlinear discretized equations. Our techniques, which we refer to as “Ordered Upwind Methods” (OUMs), use ...

متن کامل

Determining the Optimal Control When Numerically Solving Hamilton-Jacobi-Bellman PDEs in Finance

Numerous financial problems can be posed as nonlinear Hamilton-Jacobi-Bellman (HJB) partial differential equations (PDEs). In order to guarantee that the discretized equations converge to the viscosity solution, the required conditions are pointwise consistency, l∞ stability, and monotonicity. We use the positive coefficient method, choosing central differencing as much as possible, to construc...

متن کامل

Ordered upwind methods for static Hamilton-Jacobi equations.

We introduce a family of fast ordered upwind methods for approximating solutions to a wide class of static Hamilton-Jacobi equations with Dirichlet boundary conditions. Standard techniques often rely on iteration to converge to the solution of a discretized version of the partial differential equation. Our fast methods avoid iteration through a careful use of information about the characteristi...

متن کامل

A Discontinuous Galerkin Finite Element Method for Hamilton-Jacobi Equations

In this paper, we present a discontinuous Galerkin finite clement method for solving the nonlinear Hamilton-Jacobi equations. This method is based on the Runge-Kutta discontinuous Galerkin finite element method for solving conservation laws. The method has the flexibility of treating complicated geometry by using arbitrary triangulation, can achieve high order accuracy with a local, compact ste...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Sci. Comput.

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2012